Parallel Simulation of Adaptive Random Boolean Networks
نویسندگان
چکیده
منابع مشابه
Contextual Random Boolean Networks
We propose the use of Deterministic Generalized Asynchronous Random Boolean Networks [1] as models of contextual deterministic discrete dynamical systems. We show that changes in the context have drastic effects on the global properties of the same networks, namely the average number of attractors and the average percentage of states in attractors. We introduce the situation where we lack knowl...
متن کاملModular Random Boolean Networks
Random Boolean networks (RBNs) have been a popular model of genetic regulatory networks for more than four decades. However, most RBN studies have been made with random topologies, while real regulatory networks have been found to be modular. In this work, we extend classical RBNs to define modular RBNs. Statistical experiments and analytical results show that modularity has a strong effect on ...
متن کاملClassification of Random Boolean Networks
We provide the first classification of different types of Random Boolean Networks (RBNs). We study the differences of RBNs depending on the degree of synchronicity and determinism of their updating scheme. For doing so, we first define three new types of RBNs. We note some similarities and differences between different types of RBNs with the aid of a public software laboratory we developed. Par...
متن کاملDynamics of Random Boolean Networks
Boolean networks are models of genetic regulatory networks. S. Kauffman based many of his claims about spontaneous self-organization in complex systems on simulations of randomly constructed Boolean networks. Some of these claims are precise mathematical statements. We analyze these statements using combinatorial methods and show that there is partial agreement with some of Kauffman’s conclusio...
متن کاملParallel Complexity of Random Boolean Circuits
Random instances of feedforward Boolean circuits are studied both analytically and numerically. Evaluating these circuits is known to be a Pcomplete problem and thus, in the worst case, believed to be impossible to perform, even given a massively parallel computer, in a time much less than the depth of the circuit. Nonetheless, it is found that, for some ensembles of random circuits, saturation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2016
ISSN: 1877-0509
DOI: 10.1016/j.procs.2016.11.006